/*******************************************************************************
 * Copyright (C) 2010 Chris Wroe   
 * 
 *  Modifications to the initial code base are copyright of their
 *  respective authors, or their employers as appropriate.
 * 
 *  This program is free software; you can redistribute it and/or
 *  modify it under the terms of the GNU Lesser General Public License
 *  as published by the Free Software Foundation; either version 2.1 of
 *  the License, or (at your option) any later version.
 *    
 *  This program is distributed in the hope that it will be useful, but
 *  WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 *  Lesser General Public License for more details.
 *    
 *  You should have received a copy of the GNU Lesser General Public
 *  License along with this program; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
 ******************************************************************************/

package uk.co.wroedevelopments.semanticworkbench.reasoner;

/**
 * @author Chris Wroe
 *
 * if A [ B and A [ C and B ^ C [ D then A [ D
 * 
 * 
 */
public class CompletionRule2 {
/** where to start?
	keep iterating through all A [ B concept inclusion axioms until no new inclusion axioms are added
		keep an in memory map of at which iteration step 
	
	for all A where A [ B and A [ C and B ^ C [ D then A [ D
	
	go through each node via a tree walk, understand which of its ancestors are conjunctions.

 	this completion rule is like CR1 but with conjunction in the middle.
 	
 	CR3 to CR5 
 	if A [ B (and r [ s and there exists a pos r.A in the ontology and a negative r.B in the ontology)
 	  then r.A [ s.B
*/
}
